Minimal separating sets for acceptance conditions in Muller Automata
نویسندگان
چکیده
منابع مشابه
Weak Muller Acceptance Conditions for Tree Automata
Over the last decades the theory of automata on infinite objects has been an important source of tools for the specification and the verification of computer programs. Trees are more suitable than words to model nondeterminism and concurrency. In the literature, there are several examples of acceptance conditions that have been proposed for automata on infinite words and then have been fruitful...
متن کاملMinimal Separating Sets for
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...
متن کاملSingleton Acceptance Conditions in !-automata
The regular !-languages can be deened by deterministic !-automata with the Rabin acceptance condition, referring to a list of pairs (Ek; Fk) 1km of state sets of the automaton: A successful run should visit some Ek only nitely often but the corresponding Fk innnitely often. If only the non-existence, respectively existence of such visits is required, precisely the Staiger-Wagner deenable !-lang...
متن کاملMinimal completely separating systems of sets
Let [n] denote an n-set. A subset,) of [n] i from j if i and j t/:. 5'. A collection of k-sets n called (n, k) completely if, for each ordered pair j) E [n] x [71,] with i n which i from j. Let denote the size of a smallest (71" k) completely Amongst other things, it will be shown that R( 71" k) for n > except when n (Hl) 1, and R(71" k) k + 1 for G) n k 2 /2. These results build on and extend ...
متن کاملComplexity of weak acceptance conditions in tree automata
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong conditions that are defined in terms of states appearing infinitely often on the run. Weak conditions appear in the context of model-checking and translations of logical formalisms to automata. We study the complexity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00016-x